package org.aplombh.java.interview.newcoder;

import java.util.Scanner;


public class HJ108_求最小公倍数 {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int a = in.nextInt();
        int b = in.nextInt();
        System.out.println(lcm(a, b));
    }

    private static int lcm(int a, int b) {
        return a % b == 0 ? b : gcd(b, a % b);
    }

    private static int gcd(int b, int i) {
        return b % i == 0 ? i : b % i;
    }
}